A Cubical Antipodal Theorem
نویسنده
چکیده
The classical Lusternik-Schnirelman-Borsuk theorem states that if a d-sphere is covered by d + 1 closed sets, then at least one of the sets must contain a pair of antipodal points. In this paper, we prove a combinatorial version of this theorem for hypercubes. It is not hard to show that for any cover of the facets of a d-cube by d sets of facets, at least one such set contains a pair of antipodal ridges. However, we show that for any cover of the ridges of a d-cube by d sets of ridges, at least one set must contain a pair of antipodal k-faces, and we determine the maximum k for which this must occur, for all dimensions except d = 5.
منابع مشابه
Cellular Spanning Trees and Laplacians of Cubical Complexes
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit formulas for spanning tree enumerators and Laplacian eigenvalues of cubes; the latter are integers. We prove a weighted version of the eigenvalue formula, pr...
متن کاملCubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of combinatorial and stochastic parts of media theory hold almost in identical form for cubical token systems, although some underlying concepts are quite different...
متن کاملSimplicial and Cubical Complexes: Analogies and Differences
The research summarized in this thesis consists essentially of two parts. In the first, we generalize a coloring theorem of Baxter about triangulations of the plane (originally used to prove combinatorially Brouwer's fixed point theorem in two dimensions) to arbitrary dimensions and to oriented simplicial and cubical pseudomanifolds. We show that in a certain sense no other generalizations may ...
متن کاملA Proof of Sageev’s Theorem on Hyperplanes in Cat(0) Cubical Complexes
We prove that any hyperplane H in a CAT(0) cubical complex X has no self-intersections and separates X into two convex complementary components. These facts were originally proved by Sageev. Our argument shows that his theorem (or this direction of his theorem) is a corollary of Gromov’s link condition. We also give new arguments establishing some combinatorial properties of hyperplanes. We sho...
متن کاملThe spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
Let Γ be a distance-regular graph with diameter d and Kneser graph K = Γd, the distance-d graph of Γ. We say that Γ is partially antipodal when K has fewer distinct eigenvalues than Γ. In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues), and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We prov...
متن کامل